Communication-efficient distributed oblivious transfer
نویسندگان
چکیده
Article history: Received 1 December 2011 Received in revised form 4 February 2012 Accepted 21 February 2012 Available online 27 February 2012
منابع مشابه
Distributed Oblivious Transfer
This work describes distributed protocols for oblivious transfer, in which the role of the sender is divided between several servers, and a chooser (receiver) must contact a threshold of these servers in order to run the oblivious transfer protocol. These distributed oblivious transfer protocols provide information theoretic security, and do not require the parties to compute exponentiations or...
متن کاملNew Communication-Efficient Oblivious Transfer Protocols Based on Pairings
We construct two simple families of two-message (n, 1)-oblivious transfer protocols based on degree-t homomorphic cryptosystems with the communication of respectively 1 + dn/te and 3 + dn/(t + 1)e ciphertexts. The construction of both families relies on efficient cryptocomputable conditional disclosure of secret protocols; the way this is done may be of independent interest. The currently most ...
متن کاملPrivate Itemset Support Counting
Private itemset support counting (PISC) is a basic building block of various privacy-preserving data mining algorithms. Briefly, in PISC, Client wants to know the support of her itemset in Server’s database with the usual privacy guarantees. First, we show that if the number of attributes is small, then a communication-efficient PISC protocol can be constructed from a communication-efficient ob...
متن کاملAn Efficient Protocol for Restricted Adaptive Oblivious Transfer
Restricted adaptive oblivious transfer was introduced by Herranz in 2011, which is the main approach to protect user privacy in e-transactions involving operations on digital confidential data or sensitive information. There are many practical applications for restricted adaptive oblivious transfer, such as medical or financial data access, pay-per-view TV, and so on. However, so far as we know...
متن کاملA Practical Framework for $t$-Out-of- $n$ Oblivious Transfer With Security Against Covert Adversaries
Oblivious transfer plays a fundamental role in the area of secure distributed computation. In particular, this primitive is used to search items in decentralized databases. Using a variant of smooth projective hash previously presented by Zeng et al., we construct a practical framework for t-out-of-n oblivious transfer in the plain model without any set-up assumption. It can be implemented unde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 78 شماره
صفحات -
تاریخ انتشار 2012